Programming Research Group PRIMITIVE OPERATIONS ON THE BSP MODEL
نویسندگان
چکیده
The design of a complex algorithm relies heavily on a set of primitive operations and the instruments required to compile these operations into an algorithm. In this work, we examine some of these basic primitive operations and present algorithms that are suitable for the Bulk-Synchronous Parallel model. In particular, we consider algorithms for the following primitive operations: broadcasting, parallel-preex, merging, generalized and integer sorting. While our algorithms are fairly simple themselves, description of their performance in terms of the BSP parameters is somewhat complicated. The main reward for quantifying these complications, is that it enables software to be written once and for all that can be migrated eeciently among a variety of parallel machines.
منابع مشابه
Programming Research Group NETWORK PERFORMANCE ASSESSMENT UNDER THE BSP MODEL
The BSP model by L.G. Valiant has been proposed as a unifying and bridging model for the design, analysis and programming of general purpose parallel computing systems. A number of libraries have been implemented that allow programming following the BSP paradigm with one of them being the Oxford BSP Toolset. Algorithm designers and software engineers are able to study the performance of their i...
متن کاملProgramming Research Group TRANSGRESSING THE BOUNDARIES: UNIFIED SCALABLE PARALLEL PROGRAMMING
The diverse architectural features of parallel computers, and the lack of commonly accepted parallel-programming environments, meant that software development for these systems has been signi cantly more di cult than the sequential case. Until better approaches are developed, the programming environment will remain a serious obstacle to mainstream scalable parallel computing. The work reported ...
متن کاملProgramming Research Group ALGORITHMIC AND PRACTICAL CONSIDERATIONS FOR DENSE MATRIX COMPUTATIONS ON THE BSP MODEL
The Bulk-Synchronous Parallel (BSP) model of computation has been proposed by L.G. Valiant as a unifying and bridging model for the design, analysis and implementation of parallel algorithms that are both scalable and portable, among diverse parallel machines. In this work we present direct BSP algorithms for dense matrix computations such as matrix multiplication, LU decomposition, determinant...
متن کاملProgramming Research Group AN EXPERIMENTAL STUDY OF SORTING ALGORITHMS ON THE BSP MODEL: THEORY, PRACTICE AND EXPERIENCE
The Bulk-Synchronous Parallel (BSP) model of computation has been proposed by L.G. Valiant as a unifying and bridging model for the design, analysis and implementation of parallel algorithms that are both scalable and portable among diverse parallel machines. In this work we implement, using the Oxford BSP Toolset, BSPlib, a multiplicity of BSP deterministic and randomized sorting algorithms on...
متن کاملProgramming Research Group EFFICIENT DETERMINISTIC SORTING ON THE BSP MODEL
We present a new algorithm for deterministic sorting on the Bulk-Synchronous Parallel (BSP) model of computation. We sort n keys using a partitioning scheme that achieves the requirements of eeciency (one-optimality) and insensitivity against initial data distribution. Although we employ sampling to realize eeciency, we give a precise worst-case estimation of the maximum imbalance which might o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996